Finite and infinite basis in P and NP

نویسنده

  • Koji Kobayashi
چکیده

1. Overview This paper talks about monotonicity of P and NP by using monotone circuit and Log Space Transducer (LST). We can reduce Deterministic Turing Machine (DTM) to monotone circuit value problem by using LST. Therefore DTM has nonmonotonicity of the degree that LST can compute it. But Nondeterministic Turing Machine (NTM) have nonmono-tonicity that LST cannot compute it. Therefore We cannot reduce NP-Complete problem to P-Complete problem by using LST. The NP-Complete problem is different from P-Complete problem in non-monotonicity. And NP-Complete is not in P-Complete. 2. Nonmonotonicity of LST First, I show nonmonotonicity of LST. LST have read only input tape, write only output tape, read and write working tape that is logarithm size, head, and state register that is constant size. The information of working tape, head position, and state registers is replaceable and become non-monotonicity as information. Definition 1. I will use the term " Nonmonotonicity information " as the total information of working tape, head position, and state registers. I will use the term " Monotonic information " as the total information of input tape and output tape. Theorem 2. Nonmonotonic information size of LST is at most logarithm size. Proof. We can record working tape, head position and state register in logarithm size, logarithm size pointer, constant size of record. Therefore, we can record all of nonmonotonic information in logarithm size. P-Complete problem have some nonmonotonic information. But We can reduce P-Complete problem to monotone information by using LST. Definition 3. I will use the term " Flatten input " as changing each value of an input (Target input) of problem (Target problem) to 0 → 10 1 → 01 And I will use the term " Flatten problem " as that problem that reduce object input to flatten input, " Flatten transducer " as transducer that change target input to flatten input. LST can change target input to flatten input. Theorem 4. We can make Flatten transducer with LST.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of infinite composite plates with quasi-triangular holes under in-plane loading

This study used particle swarm optimization (PSO) to determine the optimal values of effective design variables acting on the stress distribution around a quasi-triangular hole in an infinite orthotropic plate. These parameters were load angle, hole orientation, bluntness, fiber angle, and material properties, which were ascertained on the basis of an analytical method used by Lekhnitskii [3]. ...

متن کامل

اثر جایگزینی کودهای شیمیایی با کود دامی بر کاهش تجمع نیترات و بهبود ماندگاری و محتوای عناصر غذایی ریحان سبز

The present study aimed to assess the substitution of inorganic fertilizer with manure for increase of quality of fresh basil and its shelf life. Experiment was conducted on randomized complete block design with eight treatments and three replications in research farm of Shahrekord University in 2015. Treatments including NP (N + P), NPS (N + P + S), NPM (N + P + micronutrients), NPSM (N + P + ...

متن کامل

Entropy of infinite systems and transformations

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...

متن کامل

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions

This paper studies the class of infinite sets that have minimal perfect hash functions­ one-to-one onto maps between the sets and E·-computable in polynomial time. We show that all standard NP-complete sets have polynomial-time computable minimal per­ fect hash functions, and give a structural condition sufficient to ensure that all infinite NP sets have polynomial-time computable minimal perfe...

متن کامل

A relation between infinite subsets and exterior center in groups

Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements  if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1  if and only if the exterior  center of G ihas finit...

متن کامل

Infinite Order Discrete Variable Representation for Quantum Scattering

A new approach to multi-dimensional quantum scattering by the infinite order discrete variable representation is presented. Determining the expansion coefficients of the wave function at the asymptotic regions by the solution of the differential Schrödinger equation, we reduce an infinite set of linear equations to a finite one. Application to the benchmark collinear H + H2 → H2 + H reaction is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012